#include <bits/stdc++.h>
using namespace std;
const int SIZE = 1e5 + 7;
int n, ans;
int a[SIZE];
int main(){
    //CSP-S Good luck
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);
    scanf("%d", &n);
    for (int i = 1; i <= n; i ++) scanf("%d", &a[i]);
    sort(a + 1, a + n + 1);
    int x = 1;
    for (int i = 1; i <= n; i ++)
        if (a[i] > a[x]) ans ++, x ++;
    printf("%d\n", n - ans);
    return 0;
}
/*
5
1 2 3 1 2

2
-------------------------------------------------
10
136 136 136 2417 136 136 2417 136 136 136

8
*/